Set functions and Souslin's hypothesis

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

Functions from a Set to a Set

The article is a continuation of [1]. We define the following concepts: a function from a set X into a set Y , denoted by “Function of X ,Y ”, the set of all functions from a set X into a set Y , denoted by Funcs(X ,Y ), and the permutation of a set (mode Permutation of X , where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1] in the new termi...

متن کامل

Cobham recursive set functions

This paper introduces the Cobham Recursive Set Functions (CRSF) as a version of polynomial time computable functions on general sets, based on a limited (bounded) form of ∈-recursion. This is inspired by Cobham’s classic definition of polynomial time functions based on limited recursion on notation. We introduce a new set composition function, and a new smash function for sets which allows poly...

متن کامل

Safe Recursive Set Functions

We introduce the safe recursive set functions based on a Bellantoni-Cook style subclass of the primitive recursive set functions. We show that the functions computed by safe recursive set functions under a list encoding of finite strings by hereditarily finite sets, are exactly the polynomial growth rate functions computed by alternating exponential time Turing machines with polynomially many a...

متن کامل

Regular Unbounded Set Functions

Set functions which are unbounded on an algebra of sets arise naturally by taking the products of bounded operators and spectral measures acting on a space of square integrable functions. The purpose of this note is to show that, provided a certain regularity condition is satissed, there is a natural integration structure associated with such a set function and an auxiliary measure, so providin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1948

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1948-09051-6